t=int(input())
for r in range(t):
r,b,d=map(int,input().split())
mi=min(r,b)
mx=max(r,b)
if(mi<=mx<=(1+d)*mi):
print("YES")
else:
print("NO")#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
#define ll long long
int main()
{
ll t;
cin>>t;
while(t--)
{
ll r,b,d;
cin>>r>>b>>d;
if(d==0)
{
if(r!=b)
{
cout<<"NO"<<endl;
continue;
}
}
int a=ceil(((double)max(r,b))/(d+1));
if(a>min(r,b))
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
}
return 0;
}1031A - Golden Plate | 1559C - Mocha and Hiking |
427B - Prison Transfer | 330A - Cakeminator |
426A - Sereja and Mugs | 363A - Soroban |
1585C - Minimize Distance | 1506E - Restoring the Permutation |
1539A - Contest Start | 363D - Renting Bikes |
1198D - Rectangle Painting 1 | 1023B - Pair of Toys |
1725A - Accumulation of Dominoes | 1675E - Replace With the Previous Minimize |
839A - Arya and Bran | 16B - Burglar and Matches |
1625B - Elementary Particles | 1725G - Garage |
1725B - Basketball Together | 735A - Ostap and Grasshopper |
1183B - Equalize Prices | 1481A - Space Navigation |
1437B - Reverse Binary Strings | 1362B - Johnny and His Hobbies |
1299A - Anu Has a Function | 1111A - Superhero Transformation |
954A - Diagonal Walking | 39F - Pacifist frogs |
1451C - String Equality | 386A - Second-Price Auction |